A branch and cut method for the degree-constrained minimum spanning tree problem

Networks ◽  
2001 ◽  
Vol 37 (2) ◽  
pp. 74-83 ◽  
Author(s):  
L. Caccetta ◽  
S.P. Hill
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Branch And Cut ◽  
Cut Method ◽  
Minimum Spanning Tree Problem ◽  
Branch And Cut Method

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method

2013 ◽  
Vol 41 ◽  
pp. 173-180 ◽  
Author(s):  
Bernard Gendron ◽  
Abilio Lucena ◽  
Alexandre Salles da Cunha ◽  
Luidi Simonetti
Keyword(s):  
Spanning Tree ◽  
Valid Inequalities ◽  
Branch And Cut ◽  
Cut Method ◽  
Branch And Cut Method

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

Networks ◽  
2011 ◽  
Vol 59 (1) ◽  
pp. 148-160 ◽  
Author(s):  
Eduardo Uchoa ◽  
Túlio A. M. Toffolo ◽  
Mauricio C. de Souza ◽  
Alexandre X. Martins ◽  
Ricardo Fukasawa
Keyword(s):  
Local Search ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Branch And Cut ◽  
Capacitated Minimum Spanning Tree ◽  
Multi Level ◽  
Minimum Spanning Tree Problem

Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem

Networks ◽  
2015 ◽  
Vol 65 (4) ◽  
pp. 367-379 ◽  
Author(s):  
Dilson Lucas Pereira ◽  
Michel Gendreau ◽  
Alexandre Salles da Cunha
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Branch And Cut ◽  
Minimum Spanning Tree Problem
Sign in / Sign up

Export Citation Format

Share Document